A Note on Connected Interior Domination in Join and Corona of Two Graphs
نویسندگان
چکیده
منابع مشابه
Secure Restrained Domination in the Join and Corona of Graphs
Let G be a connected simple graph. A restrained dominating set S of the vertex set of G, V (G) is a secure restrained dominating set of G if for each u ∈ V (G) \ S, there exists v ∈ S such that uv ∈ E(G) and the set (S \ {v}) ∪ {u} is a restrained dominating set of G. The minimum cardinality of a secure restrained dominating set of G, denoted by γsr(G), is called the secure restrained dominatio...
متن کاملSIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.
متن کاملA note on Power Domination Problem in Diameter Two Graphs
The power domination problem aims to find the minimum number of phase measurement units (PMUs) required in order to observe the entire electric power system. Zhao and Kang [6] remarked that there is no known nonplanar graph of diameter two with a power domination number that is arbitrarily large. In this note, we show that the power domination number of such graphs can be arbitrarily large.
متن کاملA note on domination and independence-domination numbers of graphs∗
Vizing’s conjecture is true for graphs G satisfying γ(G) = γ(G), where γ(G) is the domination number of a graph G and γ(G) is the independence-domination number of G, that is, the maximum, over all independent sets I in G, of the minimum number of vertices needed to dominate I . The equality γ(G) = γ(G) is known to hold for all chordal graphs and for chordless cycles of length 0 (mod 3). We pro...
متن کاملA note on domination in bipartite graphs
DOMINATING SET remains NP -complete even when instances are restricted to bipartite graphs, however, in this case VERTEX COVER is solvable in polynomial time. Consequences to VECTOR DOMINATING SET as a generalization of both are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Mathematics
سال: 2017
ISSN: 2319-765X,2278-5728
DOI: 10.9790/5728-1302036669